Finite state machine approach to digital event reconstruction

Finite state machine approach to digital event reconstruction

This paper presents a rigorous method for reconstructing events in digital systems. It is based on the idea, that once the system is described as a finite state machine, its state space can be explored to determine all possible scenarios of the incident. To formalize evidence, the evidential statement notation is introduced. It represents the facts conveyed by the evidence as a series of witnes...

A Finite-State Approach to Event Semantics

Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite automata then amount to movie cameras/projectors, or more formally, to finite Kripke structures with partial valuations. The usual regular constructs (concatenation, choice, etc) are supplemented with superposition of string...

A Finite-State Approach to Machine Translation

The problem of machine translation can be viewed as consisting of two subproblems (a) Lexical Selection and (b) Lexical Reordering. We propose stochas-tic nite-state models for these two subproblems in this paper. Stochastic nite-state models are ee-ciently learnable from data, eeective for decoding and are associated with a calculus for composing models which allows for tight integration of co...

Digital Design Automation Finite State Machine Design

A State-Machine Approach to Disambiguating Supercomputer Event Logs

Supercomputer components are inherently stateful and interdependent, so accurate assessment of an event on one component often requires knowledge of previous events on that component or others. Administrators who daily monitor and interact with the system generally possess sufficient operational context to accurately interpret events, but researchers with only historical logs are at risk for in...